H-Termination proof of /home/matraf/haskell/eval_FullyBlown

YES 0.467 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/Monad.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:

↳ HASKELL

  ↳ BR

mainModule Monad

((guard :: Bool -> [()]) :: Bool -> [()])

module Monad where

import qualified Maybe
import qualified Prelude

class Monad a => MonadPlus a where

mzero :: MonadPlus a => a b

instance MonadPlus Maybe where

instance MonadPlus [] where

mzero

[]

guard :: MonadPlus a => Bool -> a ()

guard	True	=	return ()
guard	False	=	mzero

module Maybe where

import qualified Monad
import qualified Prelude

Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

mainModule Monad

((guard :: Bool -> [()]) :: Bool -> [()])

module Maybe where

import qualified Monad
import qualified Prelude

module Monad where

import qualified Maybe
import qualified Prelude

class Monad a => MonadPlus a where

mzero :: MonadPlus a => a b

instance MonadPlus Maybe where

instance MonadPlus [] where

mzero

[]

guard :: MonadPlus a => Bool -> a ()

guard	True	=	return ()
guard	False	=	mzero

Cond Reductions:
The following Function with conditions

undefined

| False

= undefined

is transformed to

undefined = undefined1

undefined0 True = undefined

undefined1 = undefined0 False

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ Narrow

mainModule Monad

(guard :: Bool -> [()])

module Monad where

import qualified Maybe
import qualified Prelude

class Monad a => MonadPlus a where

mzero :: MonadPlus a => a b

instance MonadPlus Maybe where

instance MonadPlus [] where

mzero

[]

guard :: MonadPlus a => Bool -> a ()

guard	True	=	return ()
guard	False	=	mzero

module Maybe where

import qualified Monad
import qualified Prelude

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="guard",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="guard vy3",fontsize=16,color="burlywood",shape="triangle"];10[label="vy3/False",fontsize=10,color="white",style="solid",shape="box"];3 -> 10[label="",style="solid", color="burlywood", weight=9];
10 -> 4[label="",style="solid", color="burlywood", weight=3];
11[label="vy3/True",fontsize=10,color="white",style="solid",shape="box"];3 -> 11[label="",style="solid", color="burlywood", weight=9];
11 -> 5[label="",style="solid", color="burlywood", weight=3];
4[label="guard False",fontsize=16,color="black",shape="box"];4 -> 6[label="",style="solid", color="black", weight=3];
5[label="guard True",fontsize=16,color="black",shape="box"];5 -> 7[label="",style="solid", color="black", weight=3];
6[label="mzero",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
7[label="return ()",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3];
8[label="[]",fontsize=16,color="green",shape="box"];9[label="() : []",fontsize=16,color="green",shape="box"];}